A semantic study of the first-order predicate logic with uncertainty involved

نویسندگان

  • Xingfang Zhang
  • Xiang Li
چکیده

In this paper, we provide a semantic study of the first-order predicate logic for situations involving uncertainty. We introduce the concepts of uncertain predicate proposition, uncertain predicate formula, uncertain interpretation and degree of truth in the framework of uncertainty theory. Compared with classical predicate formula taking true value in {0, 1}, the degree of truth of uncertain predicate formula may take any value in the unit interval [0, 1]. We also show that the uncertain first-order predicate logic is consistent with the classical first-order predicate logic on some laws of the degree of truth.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

برچسب‌زنی نقش معنایی جملات فارسی با رویکرد یادگیری مبتنی بر حافظه

Abstract Extracting semantic roles is one of the major steps in representing text meaning. It refers to finding the semantic relations between a predicate and syntactic constituents in a sentence. In this paper we present a semantic role labeling system for Persian, using memory-based learning model and standard features. Our proposed system implements a two-phase architecture to first identify...

متن کامل

Identity in modal logic theorem proving

THINKER is an automated natural deduction first-order theorem proving program. This paper reports on how it was adapted so as to prove theorems in modal logic. The method employed is an "indirect semantic method", obtained by considering the semantic conditions involved in being a valid argument in these modal logics. The method is extended from propositional modal logic to predicate modal logi...

متن کامل

On the Relationship between Description Logic-based and F-Logic-based Ontologies

Many popular ontology languages are based on (subsets of) first-order predicate logic, with classes represented by unary predicates and properties by binary predicates. Specifically, the Semantic Web ontology language OWL DL is based on the Description Logic SHOIN . F-Logic is an ontology language which is also based on first-order logic, but classes and properties are modeled as terms rather t...

متن کامل

No . 2009 - 554 An Exploration of Semantic Formalisms - Part I : A Comparison of First Order Predicate Calculus , Intensional

This summary paper describes the general properties and features of two systems of semantic representation: Montague’s Intensional Logic and Jackendoff’s Conceptual Structures. Each system of representation is based upon a different type of semantic theory, and thus each one is meant to express different semantic and linguistic phenomena. The basic concepts of how each formalism works and their...

متن کامل

Some Relations Between Predicate Calculus and Semantic Net Representations of Discourse

Networks can be used to represent syntactic trees of the semantic relations that hold between words in sentences. They can be alternately symbolized as association l i s t s or conjoined sets of t r i p les . A semantic net represents a sentence as a conjoined set of binary predicates. An algorithm is presented that converts a semantic network into predicate calculus formalism. The simpler synt...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • FO & DM

دوره 13  شماره 

صفحات  -

تاریخ انتشار 2014